The Tableau Prover Generator MetTeL2
نویسندگان
چکیده
This paper introduces MetTeL2, a tableau prover generator producing Java code from the specification of a tableau calculus for a logical language. MetTeL2 is intended to provide an easy to use system for non-technical users and allow technical users to extend the generated
منابع مشابه
MetTeL2: Towards a Tableau Prover Generation Platform
This paper introduces MetTeL2, a tableau prover generator producing Java code from the specification of a logical syntax and a tableau calculus. It is intended to provide an easy to use system for non-technical users and allow technical users to extend the generated implementations.
متن کاملMetTeL2: Towards a Prover Generation Platform
This paper introduces MetTeL2, a tableau prover generator producing Java code from the specifications of a logical syntax and a tableau calculus. It is intended to provide an easy to use system for nontechnical users and allow technical users to extend the implementation of generated provers.
متن کاملSynthesising and Implementing Tableau Calculi for Interrogative Epistemic Logics
This paper presents a labelled tableau approach for deciding interrogative-epistemic logics (IEL). Tableau calculi for these logics have been derived using a recently introduced tableau synthesis method. We also consider an extension of the framework for a setting with questioning modalities over sequences of formulae called sequential questioning logic (SQL). We have implemented the calculi us...
متن کاملTerminating tableau calculi for modal logic K with global counting operators
This paper presents the first systematic treatment of tableau calculi for modal logic K with global counting operators. Using a recently introduced tableau synthesis framework we establish two terminating tableau calculi for the logic. Whereas the first calculus is a prefix tableau calculus, the second is a refinement that internalises the semantics of the logic without using nominals. We prove...
متن کاملFirst Steps towards Automated Synthesis of Tableau Systems for Interval Temporal Logics
Interval temporal logics are difficult to deal with in many respects. In the last years, various meaningful fragments of Halpern and Shoham’s modal logic of time intervals have been shown to be decidable with complexities that range from NP-complete to non-primitive recursive. However, even restricting the attention to finite interval structures, the step from modeltheoretic decidability result...
متن کامل